A New Simulated Annealing-based Tabu Search Algorithm for Unit Commitment
نویسنده
چکیده
In this paper we propose a new hybrid algorithm for solving the Unit Commitment Problem (UCP). The algorithm integrates the use of Simulated Annealing (SA) and Tabu Search (TS) for solving the UCP. The algorithm includes a step to find an initial control parameter, at which virtually all trial solutions are accepted. It uses a polynomial-time cooling schedule that is advocated in the SA literature. Furthermore the short-term memory procedures of the TS method are embedded in the SA test to prevent cycling of accepted solutions. Numerical examples from the literature are solved. Results showed an improvement in the solutions costs compared to previously obtained results.
منابع مشابه
Distribution Network Expansion Using Hybrid SA/TS Algorithm
Optimal expansion of medium-voltage power networks is a common issue in electrical distribution planning. Minimizing total cost of the objective function with technical constraints and reliability limits, make it a combinatorial problem which should be solved by optimization algorithms. This paper presents a new hybrid simulated annealing and tabu search algorithm for distribution network expan...
متن کاملTabu-KM: A Hybrid Clustering Algorithm Based on Tabu Search Approach
The clustering problem under the criterion of minimum sum of squares is a non-convex and non-linear program, which possesses many locally optimal values, resulting that its solution often falls into these trap and therefore cannot converge to global optima solution. In this paper, an efficient hybrid optimization algorithm is developed for solving this problem, called Tabu-KM. It gathers the ...
متن کاملComparison of Simulated Annealing, Genetic, and Tabu Search Algorithms for Fracture Network Modeling
The mathematical modeling of fracture networks is critical for the exploration and development of natural resources. Fractures can help the production of petroleum, water, and geothermal energy. They also greatly influence the drainage and production of methane gas from coal beds. Orientation and spatial distribution of fractures in rocks are important factors in controlling fluid flow. The obj...
متن کاملA New Metaheuristic Approach to the Unit Commitment Problem
In recent years, metaheuristics have been applied with some success to the Unit Commitment (UC) problem. Methods like Simulated Annealing, Tabu Search and Evolutionary Programming can be found in several papers, presenting results that are sufficiently interesting to justify further research in the area. In this paper, a new metaheuristic approach based on GRASP Greedy Randomized Adaptive Searc...
متن کاملA new Simulated Annealing algorithm for the robust coloring problem
The Robust Coloring Problem (RCP) is a generalization of the well-known Graph Coloring Problem where we seek for a solution that remains valid when extra edges are added. The RCP is used in scheduling of events with possible last-minute changes and study frequency assignments of the electromagnetic spectrum. This problem has been proved as NP-hard and in instances larger than 30 vertices, meta-...
متن کامل